DMGA: A Distributed Shortest Path Algorithm for Multistage Graph
نویسندگان
چکیده
منابع مشابه
A Distributed Shortest Path Algorithm for a Planar Network
An algorithm is presemed for finding a single source shortest path tree in a planar undirected distributed network with nonnegative edge COSlS. The number of messages used by the algorithm is 0 (n 513) on an n-node network.' Distributed algorithms are also presemed for finding a breadth-first spanning tree in a general network, for finding a shortest path tree in a general network, for finding ...
متن کاملAn Adaptive Distributed Dijkstra Shortest Path Algorithm
We give a distributed algorithm to compute shortest paths in a network with changing topology. It does not suffer from the routing table looping behavior associated with the Ford-Bellman tdistributed shortest path algorithm although it uses truly distributed processing. Its time and message complexities are evaluated. Pierre Humblet is with the Laboratory for Information and Decision Systems, M...
متن کاملANOTHER ADAPTIVE DISTRIBUTED SHORTEST PATH ALGORITHM Pierre
We give a distributed algorithm to compute shortest paths in a network with changing topology. It does not suffer from the routing table looping behavior associated with the FordBellman distributed shortest path algorithm although it uses truly distributed processing. Its time and message complexities are evaluated. Pierre Humblet is with the Laboratory for Information and Decision Systems, Mas...
متن کاملAn Optimal Distributed Algorithm for All-pairs Shortest-path
In this paper the network problem of determining all-pairs shortest-path is examined. A distributed algorithm which runs in O(n) time on a network of n nodes is presented. The number of messages of the algorithm is O(e+n log n) where e is the number of communication links of the network. We prove that this algorithm is time optimal.
متن کاملChoosing a Shortest Path Algorithm
Computation of shortest paths is an integral component of many applications such as transportation planning and VLSI design. Frequently, a shortest path algorithm is selected for a given application based on the performance of the algorithm for a set of test networks. The performance of this algorithm, however, can be signiicantly diierent for networks not included in the test set. Therefore, i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientific Programming
سال: 2021
ISSN: 1875-919X,1058-9244
DOI: 10.1155/2021/6639008